public class test2 {
    public void merge(int A[], int m, int B[], int n) {
        int lenA= A.length;
        int lenB= B.length;

        for (int i=lenA-1;i>=0;i--){
            A[i+lenB]=A[i];

        }

        int i=0;
        int j=0;
        int k=0;

        while (i<lenA&&j<lenB){
            if (A[i+lenB]<=B[j]){
                A[k++]=A[i+lenB];
                        i++;
            }else{

            }
        }


    }
}
